The style sheet compiler therefore constructs a decision tree which is used at run time to decide which template rule to apply to a given node. 因此样式表编译器构造了决策树,在运行时用它来决定将哪个模板规则应用于给定节点。
The first cycle involves a backward connection that starts in the decision and leads back to the join following the start node. 在第一个循环中,有一个逆向连接从decision开始并引回位于开始节点之后的join。
One way of doing so is to create a flow that represents each criterion as a decision node. 一种隔离实现方法是创建一个流,将每个标准表示为一个决策节点。
In reconstruction, the net's decision to flip a node is based on the sum of the products of the values of the other nodes and the weights between them. 在重构中,网络基于其他节点的值及它们之间的权重的乘积的和做出翻转一个节点的判定。
, there is a Decision Node that branches with the following conditions: Normal and Exception branches. 之后,有一个DecisionNode有以下条件分支:Normal和Exception分支。
The business process can invoke the rule set as its decision service node via various bindings. 业务流程可以通过多种绑定作为决策服务节点调用规则集。
Each sensor node makes a local decision according to the characteristics of sonar receiver and sends it to the fusion center node. 传感器节点依据声纳接收机的特性计算局部判决并发送给融合中心节点。
A Decision node is another type of node that supports custom implementations. Decision节点是另一种节点,它支持自定义实现。
Constructing a Decision Tree with user attributes as its node. 通过决策树可以发现那些和用户特征最为相关的一些用户属性。
In addition to owning remote SCADA function, it can use various detailed information being collected to make analysis and decision. It is especially good at dealing with specific problems, and is the intelligent information-processing node before the automatic district dispatching system. 除远程SCADA功能外,能利用集中起来的各种细节信息,进行决策分析处理,擅长处理细节问题,是地区调度自动化系统的前级智能信息处理节点。
Distributed intelligent decision support system is a computer network that is made of physically separated information processing nodes. Every node of the network has at least one decision support system or several assistant decisive functions. 分布式智能决策支持系统是由多个物理上分离的信息处理节点构成的计算机网络,网络的每个节点至少含有一个决策支持系统或具有若干辅助决策的功能。
This paper analyzes the basic SVM and the SVM classifier multi-class classification, especially about the SVM decision tree, then proposes a method for partition of the set of classes on each node classifier to build up SVM decision tree. 本文分析基本的SVM和多类SVM分类器,重点讨论了SVM决策树,提出了一种结点分类器类集合划分方案来构造SVM决策树。
In the end, this paper describes the organization and the decision making course of largescale field intelligent node based on the process and organizing factor at the intelligent node hiberarchy. 在智能节点的层次上,基于过程要素和组织要素,对大规模现场智能节点的组织决策过程进行了较为详细的描述。
The attribute with the highest information gain is chosen to make the decision tree, namely the attribute with the highest discrimination as the current node, which is easy to transform the classified rules. 讨论选择具有最高信息增益的属性构建决策树,即选定具有最高区分度的属性作为当前节点。
The binary decision tree algorithm are studied., the upper bound of its VC dimension was calculated and concluded that: upper bound of the VC dimension of binary decision tree algorithm rises as the node number of its result ( binary decision tree) increases. 运用二叉决策树算法,计算了它的VC维上限,并定性地指出:二叉决策树算法的VC维上限随其结果(决策树)复杂度的增大而提高。
The basic idea is that, after selecting core attributes as the root of the decision tree, a branching node will then be generated if the corresponding condition attribute provides the smallest knowledge roughness. 基本思想是,在选择了核属性作为决策树的根节点后,将选择知识粗糙度最小的那个条件属性作为下一个分枝结点的检验属性。
The authorization decision was made by a local service node based on the local access control polices and the global privileges of users. 服务节点做出授权决策。
A Study of Information Optimization and Decision Model in Field Intelligent Node 现场智能节点的信息优化与决策模型的研究
Neural network tree ( NNTree) is a hybrid-learning model of neural network and decision tree, which is a DT with each non-terminal node being an expert NN. It may combine the advantages of both DT and NN. 神经网络树是一种神经网络和决策树的混合学习模型,总体的结构是决策树模型,每一个非终端节点是一个专家神经网络,神经网络树有决策树和神经网络两者的优点。
In particular, we applied the ideas of knowledge reduction and β low approximation in variable precision rough set on the construction of decision rule lattice. Therefore, the strategies can effectively reduce the number of node in lattice and have a robust capability of anti noisy data. 特别地,将粗糙集知识约简的思想和可变精度粗糙集的β下近似思想应用于决策规则格的构造,有效地减少了格中节点的数目,并有较强的抗噪声数据干扰能力。
Providing the basis of the corresponding decision for the node enterprises in supply chain, this thesis studies the classic competition game models among the enterprises and makes an analysis of the expansion and application on the competition game models. 研究了供应链节点企业间竞争博弈模型,接着对竞争博弈模型的应用做了分析,最后深入研究了供应商之间的报价博弈,为供应链中的节点企业提供了相应的决策依据。
The enterprise at each node in the supply chain make the production and supply decision only on the basis of information from down river node. 具体来说,供应链的各节点企业往往只根据来自相邻的下游企业的需求信息进行生产和供应决策,需求信息的不真实性会沿着供应链逆流而上,产生逐级放大的现象。
The structure of forecasting model decision tree and solving approach of decision function at each nonterminal node is given. 文中给出了FMDT的结构及FMDT的每一个非叶结点的决策函数的基于遗传算法求解方法。
In distributed environment, not all branches of branch convergence flow can convergent to one execution node. This paper presents a decision algorithm based on common node branch convergence, which makes convergence process of branches smoothly executed. 针对在分布式环境下,分支汇聚流程各分支难以汇聚到同一执行节点问题,本文提出了一种基于公共节点决策的分支汇聚算法,使得分支汇聚流程能够顺利被执行。
The classification performance is often different when SVM is in different positions of the decision tree. Error accumulation is very serious when the mismatch happen in approach to the root node. 各个两分类SVM在决策树中的位置不同,其分类性能往往也会不同,越接近根节点的位置出现错分,其误差积累现象越严重。
To improve the dynamic negotiation of bidding decision in the previous chapter, the network deformation based on alternative set of dynamic transit and node preprocessing with expectation consideration is designed. 在招投标决策中,采用基于动态中转备选集的网络变形、以及考虑期望值的节点预处理来改进上一章的动态协商机制。
Using approximately optimal approach, multi-class samples are divided into two groups in the decision root node, and the maximum distance of cluster center and the minimal differences of sample data can gained in the same group data. 在决策根节点,采用近似最优方法将多类别样本分成两组,并使其聚类中心距离最大,且每组样本数据分歧最小。
Through extracting the performance information of the attacked nodes, this mechanism can forecast the latent menace of the attack, quantize its risk degree in realtime, and then make the corresponding decision to the attacking node. 通过提取分析被攻击节点的性能指标,该机制能预测攻击节点的潜在威胁,实时量化攻击节点给网络带来的风险程度,从而采取相应的处理措施。
Firstly, the normal form of a constraint on a decision node is discussed, then branch function is introduced to be the normal express of the numerical expres-sion in the normal form on a decision node. 首先讨论了判定节点上约束的标准形式,引入分支函数作为这一标准形式中表达式部分的标准表示。
Decision Tree algorithm is to focus on defining a measure to each node of the tree. 决策树算法的关键是给树的每个节点定义一个衡量标准。